PENDEKATAN ALGORITMA CROSS ENTROPY-GENETIC ALGORITHM UNTUK MENURUNKAN MAKESPAN PADA PENJADWALAN FLOW SHOP
نویسندگان
چکیده
منابع مشابه
Watermarking pada Video: Robustness, Impercetibility dan Pendekatan untuk Domain Terkompresi
ABSTRAK Meningkatnya penggunaan dokumen digital khususnya multimedia (citra, audio, video) dan kemudahan transmisi data melalui Internet meningkatkan kebutuhan terhadap keamanan data terhadap pelanggaran hak cipta. Watermarking merupakan pendekatan yang telah banyak digunakan dan merupakan bagian dari Digital Right Management (DRM) yang dibuat untuk memenuhi kebutuhan tersebut. Khusus untuk vid...
متن کاملMinimization of Total Weighted Tardiness and Makespan for SDST Flow Shop Scheduling using Genetic Algorithm
In the present work, SDST flow shop scheduling with minimizing the weighted sum of total weighted tardiness and makespan have been considered simultaneously. Four modified heuristic have been proposed for preliminary viable sequence. Sequence obtained from the modified heuristics is combined with the initial seed sequence of genetic algorithm and called as Genetic Algorithm (GA). Hence four dif...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA Cross Entropy-Genetic Algorithm Approach for Multi Objective Job Shop Scheduling Problem
Multi Objective Job Shop Scheduling Problem (MOJSP) is a problem for finding optimal operation sequences of some jobs according to more than one goal to achieve. The problem gets harder as its complexity increases. The development of optimization method has led many new methods to solve this problem. This paper offers Cross Entropy-Genetic Algorithm (CEGA) method to solve job shop scheduling pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Engineering and Management Industial System
سال: 2014
ISSN: 2338-3925,2477-6025
DOI: 10.21776/ub.jemis.2014.002.01.6